Formalization of SLD-Resolution in the calculus of inductive constructions
نویسنده
چکیده
This report presents a full formalization of the operational semantics of deenite programs (used in logic programming), given by SLD-Resolution. The variables renaming process used during a SLD-derivation is completely deened in an explicit manner. Furthermore, constructive proofs of two well known lemmas (lifting lemma and switching lemma) are built from this formalization in the calculus of inductive constructions. Formalisation de la SLD-RRsolution dans le calcul des constructions inductives RRsumm Ce rapport prrsente une formalisation de la ssmantique opra-tionnelle des programmes dddnis (utilisss en programmation logique), dddnie par la SLD-RRsolution. Les conditions de renommage des variables mises en jeu lors d'une SLD-ddrivation sont complltement explic-ittes. Ennn, les preuves de deux lemmes classiques (lemme de ggnnral-isation et lemme de commutation) sont construites partir de cette formalisation dans le calcul des constructions inductives.
منابع مشابه
Contributions à la sémantique de la programmation logique
This work can be split in two parts. First, we present a full formalisation of the semantics of de nite programs, in the calculus of inductive constructions. For this, we describe a formalisation of the proof of rst order terms uni cation obtained from a similar proof dealing with quasi-terms, thus showing in a general setting how partial functions can be considered in a system with total funct...
متن کاملOn the Formalization of the Modal µ-Calculus in the Calculus of Inductive Constructions
We present a Natural Deduction proof system for the propositional modal μ-calculus, and its formalization in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the formalization of modal (sequent-style) rules and of context sensitive grammars. The formalization c...
متن کاملFormalizing a Lazy Substitution Proof System for µ-calculus in the Calculus of Inductive Constructions
We present a Natural Deduction proof system for the propositional modal μ-calculus, and its formalization in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the encoding of modal (sequent-style) rules and of context sensitive grammars. The formalization can be...
متن کاملA Natural Deduction style proof system for propositional μ-calculus and its formalization in inductive type theories
In this paper, we present a formalization of Kozen’s propositional modal μ-calculus, in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the encoding of modal (“proof”) rules and of context sensitive grammars. The encoding can be used in the Coq system, providi...
متن کاملA Natural Deduction style proof system for propositional $\mu$-calculus and its formalization in inductive type theories
In this paper, we present a formalization of Kozen’s propositional modal μ-calculus, in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the encoding of modal (“proof”) rules and of context sensitive grammars. The encoding can be used in the Coq system, providi...
متن کامل